Isomorphism theorem for BSS recursively enumerable sets over real closed fields
نویسندگان
چکیده
منابع مشابه
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
The main result of this paper lies in the framework of BSS computabil-ity : it shows roughly that any recursively enumerable set S in R N , N 6 1, where R is a real closed eld, is isomorphic to R dim S by a bijec-tion ' which is decidable over S. Moreover the map S 7 ! ' is computable. Some related matters are also considered like characterization of the real closed elds with a r.e. set of innn...
متن کاملAn Isomorphism Theorem for Real-Closed Fields
A classical theorem of Steinitz [I& p. 1251 states that the characteristic of an algebraically closed field, together with it.s absolute degree of transcendency, uniquely det,ermine the field (up to isomorphism). It is easily seen that the word real-closed cannot be substituted for the words algebraically closed in this theorem. It is therefore natural to inquire what invariants other than the ...
متن کاملSelection by Recursively Enumerable Sets
For given sets A, B, and Z of natural numbers where the members of Z are z0, z1, . . . in ascending order, one says that A is selected from B by Z if A(i) = B(zi) for all i. Furthermore, say that A is selected from B if A is selected from B by some recursively enumerable set, and that A is selected from B in n steps iff there are sets E0, E1, . . . , En such that E0 = A, En = B, and Ei is selec...
متن کاملRecursively Enumerable Sets and Degrees
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and simple sets. 2. Dominating functions and quotient lattices. 3. Maximal sets and high degrees. 4. Low degrees, atomless sets, and invariant degree classes. 5. Incompleteness and completeness for noninvariant properties. Chapter II. The structure, automorphisms, and elementa...
متن کاملEquality sets for recursively enumerable languages
We consider shifted equality sets of the form EG(a, g1, g2) = {w | g1(w) = ag2(w)}, where g1 and g2 are nonerasing morphisms and a is a letter. We are interested in the family consisting of the languages h(EG(J)), where h is a coding and EG(J) is a shifted equality set. We prove several closure properties for this family. Moreover, we show that every every recursively enumerable language L ⊆ A∗...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00103-6